computational complexity theory

Results: 2049



#Item
901Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305

Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-05-21 20:27:46
902Leidimo metai: 2012; Institucijoje pareigas užimantys autoriai. I lygio padalinys: 580000 – VU Matematikos ir informatikos institutas; MOKSLINĖS PUBLIKACIJOS MONOGRAFIJOS 1. Jukna, Stasys. Boolean Function Complexity

Leidimo metai: 2012; Institucijoje pareigas užimantys autoriai. I lygio padalinys: 580000 – VU Matematikos ir informatikos institutas; MOKSLINĖS PUBLIKACIJOS MONOGRAFIJOS 1. Jukna, Stasys. Boolean Function Complexity

Add to Reading List

Source URL: www.mii.lt

Language: English - Date: 2015-02-04 10:03:32
903A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY Ray J. Solomonoff ∗ Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A.

A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY Ray J. Solomonoff ∗ Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A.

Add to Reading List

Source URL: world.std.com

Language: English - Date: 2014-09-17 03:58:53
904Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema

Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2010-11-05 18:41:12
905The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the fifth year the EACSL Ackermann Award is generously sponsored. Our sponsor f

The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the fifth year the EACSL Ackermann Award is generously sponsored. Our sponsor f

Add to Reading List

Source URL: eacsl.kahle.ch

Language: English - Date: 2013-12-08 17:58:05
906SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel

SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel

Add to Reading List

Source URL: drpage.pagewizardgames.com

Language: English - Date: 2015-02-07 18:05:03
907On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik

On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-07-29 14:23:20
908TR IDSIA–16–03, revision 2.0; 30 October 2003 Progress In Incremental Machine Learning Ray J. Solomonoff

TR IDSIA–16–03, revision 2.0; 30 October 2003 Progress In Incremental Machine Learning Ray J. Solomonoff

Add to Reading List

Source URL: world.std.com

Language: English - Date: 2014-09-18 21:26:32
909Small Polynomial Path Orders in TCT∗ Martin Avanzini1 , Georg Moser1 , and Michael Schaper1 1 Institute of Computer Science, University of Innsbruck, Austria

Small Polynomial Path Orders in TCT∗ Martin Avanzini1 , Georg Moser1 , and Michael Schaper1 1 Institute of Computer Science, University of Innsbruck, Austria

Add to Reading List

Source URL: www.imn.htwk-leipzig.de

Language: English - Date: 2013-08-26 10:13:12
    910On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik

    On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik

    Add to Reading List

    Source URL: lovelace.thi.informatik.uni-frankfurt.de

    Language: English - Date: 2009-01-04 06:50:40